New Overlapping Coordination Methodology by Nonfeasible Decomposition Method : 2 Level Method
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Non-overlapping Domain Decomposition Method and Nodal Finite Element Method
The non-overlapping domain decomposition method is an efficient approach for solving time harmonic scattering wave problems. It is used here to reduce large size systems solution to that of several systems of small size and to construct efficient procedures to couple finite element and boundary element methods. The lack of a satisfactory treatment of the so-called cross-points, nodes being shar...
متن کاملHierarchical Overlapping Coordination for Large-Scale Optimization by Decomposition
Decomposition of large engineering design problems into smaller design subproblems enhances robustness and speed of numerical solution algorithms. Design subproblems can be solved in parallel, using the optimization technique most suitable for the underlying subproblem. This also reflects the typical multidisciplinary nature of system design problems and allows better interpretation of results....
متن کاملAn Optimal Two-Level Overlapping Domain Decomposition Method for Elliptic Problems in Two and Three Dimensions
We consider the solution of linear systems of algebraic equations that arise from elliptic nite element problems We study a two level overlapping domain decomposition method that can be viewed as a combination of the additive and multiplicative Schwarz methods This method combines the advantages of the two methods It converges faster than the additive Schwarz algorithm and is more parallelizabl...
متن کاملA Parallel Overlapping Time-Domain Decomposition Method for ODEs
We introduce an overlapping time-domain decomposition for linear initial-value 7 problems which gives rise to an efficient solution method for parallel computers without 8 resorting to the frequency domain. This parallel method exploits the fact that homogeneous 9 initial-value problems can be integrated much faster than inhomogeneous problems by using 10 an efficient Arnoldi approximation for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 1991
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.4.118